A note on a general non linear knapsack problemMATHUR, K; SALKIN, H. M; MOHANTY, B. B et al.Operations research letters. 1986, Vol 5, Num 2, pp 79-81, issn 0167-6377Article

Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hullsMOSTOFA AKBAR, Md; SOHEL RAHMAN, M; KAYKOBAD, M et al.Computers & operations research. 2006, Vol 33, Num 5, pp 1259-1273, issn 0305-0548, 15 p.Article

La Réduction des Réseaux en Crytographie = Lattice reduction in CryptographyJoux, Antoine; Stern, Jacques.1993, 82 p.Thesis

Sensitivity analysis for knapsack problems : a negative resultBLAIR, C.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 133-139, issn 0166-218XArticle

An attacking method for multiplicative Knapsack type public key cryptosystem based on finite fieldKUROSAWA, K; ITOH, T; SHIGETA, H et al.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1987, Vol 70, Num 1, pp 37-41, issn 0387-236XArticle

A new enumeration scheme for the Knapsack problemYANASSE, H. H; SOMA, N. Y.Discrete applied mathematics. 1987, Vol 18, Num 2, pp 235-245, issn 0166-218XArticle

Sacs à ods orthogonaux et sacs à dos divisibles = Orthogonal and divisible knapsacksHARARI, S.TS. Traitement du signal. 1992, Vol 9, Num 3, pp 273-279, issn 0765-0019Article

Efficient algorithm for solving multiconstraint zero-one Knapsack problems to optimalityGAVISH, B; PIRKUL, H.Mathematical programming. 1985, Vol 31, Num 1, pp 78-105, issn 0025-5610Article

Satisfiability problem and lattice basis problem = Problème de satisfaisabilité et problème de réseauxHusain, Dhiaiddin; Morel, H.1996, 88 p.Thesis

Approximating the Orthogonal Knapsack Problem for HypercubesHARREN, Rolf.Lecture notes in computer science. 2006, pp 238-249, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Removable online knapsack problemsIWAMA, Kazuo; TAKETOMI, Shiro.Lecture notes in computer science. 2002, pp 293-305, issn 0302-9743, isbn 3-540-43864-5, 13 p.Conference Paper

The use of duality to improve the efficiency of methods of solving the quadratic knapsack problemKISELEV, V. D; SUKMANOV, S. A.Computational mathematics and mathematical physics. 1993, Vol 33, Num 2, pp 287-288, issn 0965-5425Article

An algorithm for solving a structured class of linear programming problemsERENGUC, S. S.Operations research letters. 1986, Vol 4, Num 6, pp 293-299, issn 0167-6377Article

Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature schemeODLYZKO, A. M.IEEE transactions on information theory. 1984, Vol 30, Num 4, pp 594-601, issn 0018-9448Article

Un algorithme hybride pour le problème de sac à dos multi-objectifs = Hybrid algorithm for multiobjective snapsack problemBARICHARD, Vincent; HAO, Jin-Kao.Journées nationales sur la résolution pratique de problèmes NP-complets. 2002, pp 19-29, isbn 2-7261-1208-0, 11 p.Conference Paper

The memory indexing evolutionary algorithm for dynamic environmentsKARAMAN, Aydm; UYAR, Sima; ERYIGIT, Gulsen et al.Lecture notes in computer science. 2005, pp 563-573, issn 0302-9743, isbn 3-540-25396-3, 11 p.Conference Paper

On the Dietrich-Escudero approach for solving the 0-1 knapsack problem with a 0-1 objective functionESCUDERO, L. F; PEREZ, G; GARIN, A et al.European journal of operational research. 1994, Vol 73, Num 1, pp 167-168, issn 0377-2217Article

Knapsack nutritionCLARK, N.Physician and sportsmedicine. 1993, Vol 21, Num 9, pp 21-22, issn 0091-3847Article

New multistage knapsack public-key cryptosystemHUSSAIN ALI HUSSAIN; JAFAR WADI ABDUL SADA; KALIPHA, S. M et al.International journal of systems science. 1991, Vol 22, Num 11, pp 2313-2320, issn 0020-7721Article

On separating cover inequalities for the multidimensional knapsack problemBEKTAS, Tolga; OGUZ, Osman.Computers & operations research. 2007, Vol 34, Num 6, pp 1771-1776, issn 0305-0548, 6 p.Article

Cryptanalysis of the Chor-Rivest cryptosystemVAUDENAY, Serge.Journal of cryptology. 2001, Vol 14, Num 2, pp 87-100, issn 0933-2790Article

A new fully polynomial time approximation scheme for the knapsack problemKELLERER, H; PFERSCHY, U.Journal of combinatorial optimization. 1999, Vol 3, Num 1, pp 59-71, issn 1382-6905Article

A polynomial-time algorithm for knapsack with divisible item sizesVERHAEGH, W. F. J; AARTS, E. H. L.Information processing letters. 1997, Vol 62, Num 4, pp 217-221, issn 0020-0190Article

The zero-one knapsack problem with equality constraintKAUFMAN, L; PLASTRIA, F; TUBEECKX, S et al.European journal of operational research. 1985, Vol 19, Num 3, pp 384-389, issn 0377-2217Article

Polynomial-time algorithms for regular set-convering and threshold synthesisPELED, U. N; SIMEONE, B.Discrete applied mathematics. 1985, Vol 12, Num 1, pp 57-69, issn 0166-218XArticle